On the Jacobian Ideal of a Trilinear Form

نویسندگان

  • G. Boffi
  • W. Bruns
  • A. Guerrieri
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Jacobian Ideals of Trilinear Forms: an Application of 1-genericity

be a trilinear form in R, and let JA denote the ideal of R generated by all the partial derivatives of A. A question that arises from the theory of hyperdeterminants (see [GKZ, page 445]) is the following: What can be said about the ideal JA? A reason for this question emerges, among other things, from results which show that information on the depth of JA and, more finely, on the primary decom...

متن کامل

On the Jacobian Ideal of the Binary Discriminant

Let ∆ denote the discriminant of the generic binary d-ic. We show that for d ≥ 3, the Jacobian ideal of ∆ is perfect of height 2. Moreover we describe its SL2-equivariant minimal resolution and the associated differential equations satisfied by ∆. A similar result is proved for the resultant of two forms of orders d, e whenever d ≥ e − 1. If Φn denotes the locus of binary forms with total root ...

متن کامل

Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Solving systems of nonlinear equations using decomposition technique

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997